A lower bound for the steiner tree problem in directed graphs
نویسنده
چکیده
Let V be a finite set of points in the plane. In this paper, we show that the ratio of the lengths of Steiner minimal tree for V and the minimal spanning tree for V can never be less than
منابع مشابه
A Note on Online Steiner Tree Problems
We introduce and study a new Steiner tree problem variation called the bursty Steiner tree problem where new nodes arrive into bursts. This is an online problem which becomes the well-known online Steiner tree problem if the number of nodes in each burst is exactly one and becomes the classical Steiner tree problem if all the nodes that need to be connected appear in a single burst. In undirect...
متن کاملSteiner Transitive-Closure Spanners of Low-Dimensional Posets
Given a directed graph G = (V,E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH) such that (1) V ⊆ VH and (2) for all vertices v, u ∈ V , the distance from v to u in H is at most k if u is reachable from v in G, and ∞ otherwise. Motivated by applications to property reconstruction and access control hierarchies, we conce...
متن کاملA Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
We demonstrate that the integrality gap of the natural cut-based LP relaxation for the directed Steiner tree problem is O(log k) in quasi-bipartite graphs with k terminals. Such instances can be seen to generalize set cover, so the integrality gap analysis is tight up to a constant factor. A novel aspect of our approach is that we use the primal-dual method; a technique that is rarely used in d...
متن کاملA Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio ofthe weight of antiparallel edges in the graph, and can be used as a measure of the heterogeneityof links in a data communication network. In this paper we provide a near-tight upper bound onthe competitive ratio of the Online Steiner Tree problem in graphs of bounded edge asymmetry α.This...
متن کاملParameterized Complexity of Directed Steiner Tree on Sparse Graphs
We study the parameterized complexity of the directed variant of the classical Steiner Tree problem on various classes of directed sparse graphs. While the parameterized complexity of Steiner Tree parameterized by the number of terminals is well understood, not much is known about the parameterization by the number of non-terminals in the solution tree. All that is known for this parameterizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 20 شماره
صفحات -
تاریخ انتشار 1990